Non-deterministic ideal operators: An adequate tool for formalization in Data Bases

نویسندگان

  • Pablo Cordero
  • Angel Mora
  • Inmaculada Perez de Guzmán
  • Manuel Enciso
چکیده

In this paper, we propose the application of formal methods to Software Engineering. The most used data model is the relational model and we present, within the general framework of lattice theory, this analysis of functional dependencies. For this reason, we characterize the concept of f -family by means of a new concept which we call non-deterministic ideal operator (nd.ideal-o). The study of nd.ideal-o.s allows us to obtain results about functional dependencies as trivial particularizations, to clarify the semantics of the functional dependencies and to progress in their efficient use, and to extend the concept of schema. Moreover, the algebraic characterization of the concept of Key of a schema allows us to propose new formal definitions in the lattice framework for classical normal forms in relation schemata. We give a formal definition of the normal forms for functional dependencies more frequently used in the bibliography: the second normal form (2FN), the third normal form(3FN) and Boyce–Codd’s normal form (FNBC). © 2007 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Cluster Machines and Function Classes

We consider a special kind of non-deterministic Turing machines. Cluster machines are distinguished by a neighbourhood relationship between accepting paths. Based on a formalization using equivalence relations some subtle properties of these machines are proven. Moreover, by abstraction we gain the machine-independend concept of cluster sets which is the starting point to establish cluster oper...

متن کامل

Inference Methods for Partially Redundant Rule Bases

This paper discusses inference strategies for fuzzy rule bases resulting from databased automatic rule generation algorithms. Typical methods for rule generation are tree-oriented, statistical and evolutionary approaches. The aim of these data-based methods is the design of compact rule bases with a small number of interpretable rules which map the learning data set and provide a su cient stati...

متن کامل

G-Frames, g-orthonormal bases and g-Riesz bases

G-Frames in Hilbert spaces are a redundant set of operators which yield a representation for each vector in the space. In this paper we investigate the connection between g-frames, g-orthonormal bases and g-Riesz bases. We show that a family of bounded operators is a g-Bessel sequences if and only if the Gram matrix associated to its denes a bounded operator.

متن کامل

Modified homotopy method to solve non-linear integral equations

In this article we decide to define a modified homotopy perturbation for solving non-linear integral equations. Almost, all of the papers that was presented to solve non-linear problems by the homotopy method, they used from two non-linear and linear operators. But we convert a non-linear problem to two suitable non-linear operators also we use from appropriate bases functions such as Legendre ...

متن کامل

(Pure) transcendence bases in $\phi$-deformed shuffle bialgebras

Computations with integro-differential operators are often carried out in an associative algebra with unit and they are essentially non-commutative computations. By adjoining a cocommutative co-product, one can have those operators perform on a bialgebra isomorphic to an enveloping algebra. That gives an adequate framework for a computer-algebra implementation via monoidal factorization, (pure)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 156  شماره 

صفحات  -

تاریخ انتشار 2008